Decompositions of complete graphs into circulants
نویسندگان
چکیده
Let C(n;S) be a fixed circulant. The main problem is to determine the spectrum for values of v such that the complete graph Kv admits an edge-disjoint decomposition into subgraphs each of which is isomorphic to C(n;S). A complete solution in not to be expected since some instances correspond to famous existence problems (for instance, the existence of BIBD’s with λ = 1). On the other hand, the well-known result of Richard Wilson guarantees the asymptotic existence of a decomposition.
منابع مشابه
Well-covered circulant graphs
A graph is well-covered if every independent set can be extended to a maximum independent set. We show that it is co-NP-complete to determine whether an arbitrary graph is well-covered, even when restricted to the family of circulant graphs. Despite the intractability of characterizing the complete set of well-covered circulant graphs, we apply the theory of independence polynomials to show tha...
متن کاملOn Circulants Uniquely Characterized by their Independence Polynomials
In [18], Farrell and Whitehead investigate circulant graphs that are uniquely characterized by their matching and chromatic polynomials (i.e., graphs that are “matching unique” and “chromatic unique”). They develop a partial classification theorem, by finding all matching unique and chromatic unique circulants on n vertices, for each n ≤ 8. In this paper, we explore circulant graphs that are un...
متن کاملConstructions of Self-complementary Circulants with No Multiplicative Isomorphisms
The main topic of the paper is the question of the existence of self-complementary Cayley graphs Cay(G; S) with the property S 6 = G # n S for all 2 Aut(G). We answer this question in the positive by constructing an innnite family of self-complementary circulants with this property. Moreover, we obtain a complete classiication of primes p for which there exist self-complementary circulants of o...
متن کاملMixing of quantum walk on circulant bunkbeds
We give new observations on the mixing dynamics of a continuous-time quantum walk on circulants and their bunkbed extensions. These bunkbeds are defined through two standard graph operators: the join G + H and the Cartesian product G ⊕ H of graphs G and H . Our results include the following: • The quantum walk is average uniform mixing on circulants with bounded eigenvalue multiplicity. This ex...
متن کاملBi-cyclic decompositions of complete graphs into spanning trees
We examine decompositions of complete graphs with an even number of vertices, K2n, into n isomorphic spanning trees. While methods of such decompositions into symmetric trees have been known, we develop here a more general method based on a new type of vertex labelling, called flexible q-labelling. This labelling is a generalization of labellings introduced by Rosa and Eldergill.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 339 شماره
صفحات -
تاریخ انتشار 2016